Incomparable Effectiveness—Apples to Apples?–Reply–I
نویسندگان
چکیده
منابع مشابه
How to Compare the Incomparable
A technique for deciding between two processes, one with cost (xA ,yA) and the second with cost (xB ,yB) where xA>xB and yA<yB and no further information is available, is derived, using dimensionand gauge-theory like arguments. The technique can be summarized as: If you can’t add them, multiply them.
متن کاملFair Exchange Is Incomparable to Consensus
In asynchronous systems where processes are prone to crash failures, we show that fair exchange is incomparable to distributed consensus. By incomparability we mean there exist failure detector classes that solve fair exchange and not distributed consensus, and vice versa. Remarkably, this is in contrast to the folklore belief that solving fair exchange is generally harder than solving distribu...
متن کاملDistributed Synthesis with Incomparable Information
Given (1) an architecture defined by processes and communication channels between them or with the environment, and (2) a specification on the messages transmitted over the channels, distributed synthesis aims at deciding existence of local programs, one for each process, that together meet the specification, whatever the environment does. Recent work shows that this problem can be solved when ...
متن کاملIncomparable Actions of Free Groups
Suppose that X is a standard Borel space, E is a countable Borel equivalence relation on X, and μ is an E-invariant Borel probability measure on X. We consider the circumstances under which for every countable non-abelian free group Γ, there is a Borel sequence (·r)r∈R of free actions of Γ on X, generating subequivalence relations Er of E with respect to which μ is ergodic, with the further pro...
متن کاملA Classification of Incomparable States
Let {|ψ〉 , |φ〉} be an incomparable pair of states (|ψ〉 = |φ〉), i.e., |ψ〉 and |φ〉 cannot be transformed to each other with probability one by local transformations and classical communication (LOCC). We show that incomparable states can be multiple-copy transformable, i.e., there can exist a k, such that |ψ〉 → |φ〉, i.e., k+1 copies of |ψ〉 can be transformed to k + 1 copies of |φ〉 with probabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mayo Clinic Proceedings
سال: 2010
ISSN: 0025-6196
DOI: 10.4065/mcp.2010.0052